Wave-Based Turing Machine: Time Reversal and Information Erasing.
نویسندگان
چکیده
The investigation of dynamical systems has revealed a deep-rooted difference between waves and objects regarding temporal reversibility and particlelike objects. In nondissipative chaos, the dynamic of waves always remains time reversible, unlike that of particles. Here, we explore the dynamics of a wave-particle entity. It consists in a drop bouncing on a vibrated liquid bath, self-propelled and piloted by the surface waves it generates. This walker, in which there is an information exchange between the particle and the wave, can be analyzed in terms of a Turing machine with waves as the information repository. The experiments reveal that in this system, the drop can read information backwards while erasing it. The drop can thus backtrack on its previous trajectory. A transient temporal reversibility, restricted to the drop motion, is obtained in spite of the system being both dissipative and chaotic.
منابع مشابه
Some improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملVisits, Crosses, and Reversals for Nondeterministic Off-Line Machines
The different concepts involved in "reversal complexity"--counting reversals (sweeps), visits to a square, or crossing sequences--are discussed for nondeterministic off-line Turing machines with one working tape and for preset Turing machines, a generalization of two-way checking automata. Restriction to finite reversals or visits or crosses yields the same family, NSPACE(log2 n), for off-line ...
متن کاملOn quasi-unilateral universal Turing machines
Four universal Turing machines are given with strong limitations on the number of left instructions in their program. One of the machines is morever non-erasing, i.e. it does not erase any 1 written on the tape. c © 2001 Elsevier Science B.V. All rights reserved.
متن کاملar X iv : m at h - ph / 0 40 70 56 v 2 2 8 Ju l 2 00 4 INTERNAL TURING MACHINES
Using nonstandard analysis, we will extend the classical Turing machines into the internal Turing machines. The internal Turing machines have the capability to work with infinite (∗-finite) number of bits while keeping the finite combinatoric structures of the classical Turing machines. We will show the following. The internal deterministic Turing machines can do in ∗-polynomial time what a cla...
متن کاملInternal Turing Machines
Using nonstandard analysis, we will extend the classical Turing machines into the internal Turing machines. The internal Turing machines have the capability to work with infinite (∗-finite) number of bits while keeping the finite combinatoric structures of the classical Turing machines. We will show the following. The internal deterministic Turing machines can do in ∗-polynomial time what a cla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Physical review letters
دوره 117 9 شماره
صفحات -
تاریخ انتشار 2016